DNA Computing Model of the 0-1 Programming Problem

DNA computing aims at using nucleic acids for computing. Since micromolar DNA solutions can act as billions of parallel nanoprocessors, DNA computers can in theory solve optimization problems that require vast search spaces. However, the actual parallelism currently being achieved is at least a hundred million-fold lower than the number of DNA molecules used. This is due to the quantity of DNA molecules of one species that is required to produce a detectable output to the computations. In order to miniaturize the computation and considerably reduce the amount of DNA needed, we proposed that fluorescence labeling techniques can be applied to DNA computing. In the paper, we solved the simple 0-1 programming problem with fluorescence labeling techniques based on surface chemistry. It is attempt to apply DNA computing to programming problem. Mathematics Subject Classification: 20C17